Meta-Heuristic Algorithms based on Integer Programming for Shelf Space Allocation Problems

نویسندگان

چکیده

Retail shelf space management, which is one of the most complex aspects retailing, can be defined as determining when, where and in what quantities products will displayed dynamically updating display considering changing market conditions. Although it an important problem, research papers that study rectangular arrangement to optimize profit are limited. In this paper, we determine facing units maximize for allocation problem. To solve our two-dimensional develop two matheuristic algorithms by using integer programming genetic algorithm (TP-GA) firefly (TP-ABA) meta-heuristics together. The performances mathheuristics were compared with a real-world dataset from bookstore. TP-GA TP-ABA methods able generate near-optimal solutions average 4.47% 4.57% GAPs, respectively. We also instances up 900 products. These algorithms, successful assignment used similar problems such books bookstore, product families grocery store, or advertisements on websites.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Heuristic, meta-heuristic and hyper-heuristic approaches for fresh produce inventory control and shelf space allocation

The allocation of fresh produce to shelf space represents a new decision support research area which is motivated by the desire of many retailers to improve their service due to the increasing demand for fresh food. However, automated decision making for fresh produce allocation is challenging because of the very short lifetime of fresh products. This paper considers a recently proposed practic...

متن کامل

Efficiency of Robust Heuristic Gradient Based Enumerative and Tunneling Algorithms for Constrained Integer Programming Problems

This paper presents performance of two robust gradient-based heuristic optimization procedures based on 3n enumeration and tunneling approach to seek global optimum of constrained integer problems. Both these procedures consist of two distinct phases for locating the global optimum of integer problems with a linear or non-linear objective function subject to linear or nonlinear constraints. In ...

متن کامل

Integer Programming Based Algorithms for Peg Solitaire Problems

Peg solitaire is a one player game using pegs and a board with some holes. The game is classical, and nowadays sold in many parts of the world under the trade name of Hi-Q. In this paper, we dealt with the peg solitaire problem as an integer programming problem. We proposed algorithms based on the backtrack search method and relaxation methods for integer programming problem. The algorithms fir...

متن کامل

Two Strategies Based on Meta-Heuristic Algorithms for Parallel Row Ordering Problem (PROP)

Proper arrangement of facility layout is a key issue in management that influences efficiency and the profitability of the manufacturing systems. Parallel Row Ordering Problem (PROP) is a special case of facility layout problem and consists of looking for the best location of n facilities while similar facilities (facilities which has some characteristics in common) should be arranged in a row ...

متن کامل

A Framework for Adapting Population-Based and Heuristic Algorithms for Dynamic Optimization Problems

In this paper, a general framework was presented to boost heuristic optimization algorithms based on swarm intelligence from static to dynamic environments. Regarding the problems of dynamic optimization as opposed to static environments, evaluation function or constraints change in the time and hence place of optimization. The subject matter of the framework is based on the variability of the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Europan journal of science and technology

سال: 2022

ISSN: ['2148-2683']

DOI: https://doi.org/10.31590/ejosat.1121006